نتایج جستجو برای: probabilistic particle swarm optimization

تعداد نتایج: 543011  

Journal: :international journal of civil engineering 0
a. kaveh iust a. nasrolahi iust

in this paper, a new enhanced version of the particle swarm optimization (pso) is presented. an important modification is made by adding probabilistic functions into pso, and it is named probabilistic particle swarm optimization (ppso). since the variation of the velocity of particles in pso constitutes its search engine, it should provide two phases of optimization process which are: explorati...

Journal: :advances in railway engineering,an international journal 2013
masoud rabbani neda manavizadeh a shamekhi

in this article, multiple-product pvrp with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. a mathematical formulation was provided for this problem. each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. to solve the problem, two meta-heuristic methods...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

Journal: :مهندسی برق و الکترونیک ایران 0
mehran taghipour-gorjikolaie ismaeil miri seyyed-mohammad razavi javad sadri

handwritten digit recognition can be categorized as a classification problem. probabilistic neural network (pnn) is one of the most effective and useful classifiers, which works based on bayesian rule. in this paper, in order to recognize persian (farsi) handwritten digit recognition, a combination of intelligent clustering method and pnn has been utilized. hoda database, which includes 80000 p...

Journal: :transactions on combinatorics 2013
soniya lalwani sorabh singhal rajesh kumar nilama gupta

numerous problems encountered in real life cannot be actually formulated as a single objective problem; hence the requirement of multi-objective optimization (moo) had arisen several years ago. due to the complexities in such type of problems powerful heuristic techniques were needed, which has been strongly satisfied by swarm intelligence (si) techniques. particle swarm optimization (pso) has ...

In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...

2012
Peter Andras

Particle swarm optimization is a popular method for solving difficult optimization problems. There have been attempts to formulate the method in formal probabilistic or stochastic terms (e.g. bare bones particle swarm) with the aim to achieve more generality and explain the practical behavior of the method. Here we present a Bayesian interpretation of the particle swarm optimization. This inter...

Journal: :journal of medical signals and sensors 0
zahra assarzadeh ahmad reza naghsh nilchi

in this paper, a chaotic particle swarm optimization with mutation-based classifier particle swarm optimization is proposed to classifypatterns of different classes in the feature space. the introduced mutation operators and chaotic sequences allows us to overcomethe problem of early convergence into a local minima associated with particle swarm optimization algorithms. that is, the mutationope...

2005
Evangelos Papacostantis Andries Petrus Engelbrecht Nelis Franken

Coevolutionary techniques in combination with particle swarm optimization algorithms and neural networks have shown to be very successful in finding strong game playing agents for a number of deterministic games. This paper investigates the applicability of a PSO coevolutionary approach to probabilistic games. For the purposes of this paper, a probabilistic variation of the tic-tac-toe game is ...

2013
Ruochen Liu Chenlin Ma Wenping Ma Yangyang Li

The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each part...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید